An Adaptive Initial Cluster Center Selection K-means Algorithm and Implementation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing an Algorithm for Cancerous Tissue Segmentation Using Adaptive K-means Cluttering and Discrete Wavelet Transform

Background: Breast cancer is currently one of the leading causes of death among women worldwide. The diagnosis and separation of cancerous tumors in mammographic imagesrequire accuracy, experience and time, and it has always posed itself as a major challenge to the radiologists and physicians. Objective: This paper proposes a new algorithm which draws on discrete wavelet transform and adaptive ...

متن کامل

Cluster center initialization algorithm for K-means clustering

Performance of iterative clustering algorithms which converges to numerous local minima depend highly on initial cluster centers. Generally initial cluster centers are selected randomly. In this paper we propose an algorithm to compute initial cluster centers for K-means clustering. This algorithm is based on two observations that some of the patterns are very similar to each other and that is ...

متن کامل

A fast k-means clustering algorithm using cluster center displacement

In this paper, we present a fuzzy k-means clustering algorithm using the cluster center displacement between successive iterative processes to reduce the computational complexity of conventional fuzzy k-means clustering algorithm. The proposed method, referred to as CDFKM, first classifies cluster centers into active and stable groups. Our method skips the distance calculations for stable clust...

متن کامل

Selection of Initial Centroids for k-Means Algorithm

Clustering is one of the important data mining techniques. k-Means [1] is one of the most important algorithm for Clustering. Traditional k-Means algorithm selects initial centroids randomly and in k-Means algorithm result of clustering highly depends on selection of initial centroids. k-Means algorithm is sensitive to initial centroids so proper selection of initial centroids is necessary. Thi...

متن کامل

Enhanced Initial Centroids for K-means Algorithm

This paper focuses on the enhanced initial centroids for the K-means algorithm. The original kmeans is using the random choice of init ial seeds which is a major limitation of the orig inal K-means algorithm because it produces less reliab le result of clustering the data. The enhanced method of the k-means algorithm includes the computation of the weighted mean to improve the centroids initial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Technology Journal

سال: 2013

ISSN: 1812-5638

DOI: 10.3923/itj.2013.5665.5668